Probabilistic Approaches to the AXB = YCZ Calibration Problem in Multi-Robot Systems

نویسندگان

  • Qianli Ma
  • Zachariah Goh
  • Gregory S. Chirikjian
چکیده

In recent years, the topic of multi-robot systems has become very popular. These systems have been demonstrated in various applications, including exploration, construction, and warehouse operations. In order for the whole system to function properly, sensor calibrations such as determining the camera frame relative to the IMU frame are important. Compared to the traditional hand-eye & robot-world calibration, a relatively new problem called the AXB = Y CZ calibration problem arises in the multi-robot scenario, where A,B,C are rigid body transformations measured from sensors and X,Y, Z are unknown transformations to be calibrated. Several solvers have been proposed previously in different application areas that can solve for X,Y and Z simultaneously. However, all of the solvers assume a priori knowledge of the exact correspondence among the data streams {Ai}, {Bi} and {Ci}. While that assumption may be justified in some scenarios, in the application domain of multi-robot systems, which may use ad hoc and asynchronous communication protocols, knowledge of this correspondence generally cannot be assumed. Moreover, the existing methods in the literature require good initial estimates that are not always easy or possible to obtain. In this paper, we propose two probabilistic approaches that can solve the AXB = Y CZ problem without a priori knowledge of the correspondence of the data. In addition, no initial estimates are required for recovering X , Y and Z. These methods are particularly well suited for multi-robot systems, and also apply to other areas of robotics in which AXB = Y CZ arises.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Multi Objective Optimal Reactive Power Dispatch Considering Load Uncertainties Using Monte Carlo Simulations

Optimal Reactive Power Dispatch (ORPD) is a multi-variable problem with nonlinear constraints and continuous/discrete decision variables. Due to the stochastic behavior of loads, the ORPD requires a probabilistic mathematical model. In this paper, Monte Carlo Simulation (MCS) is used for modeling of load uncertainties in the ORPD problem. The problem is formulated as a nonlinear constrained mul...

متن کامل

Efficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

متن کامل

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

A Probabilistic Approach to Transmission Expansion Planning in Deregulated Power Systems under Uncertainties

Restructuring of power system has faced this industry with numerous uncertainties. As a result, transmission expansion planning (TEP) like many other problems has become a very challenging problem in such systems. Due to these changes, various approaches have been proposed for TEP in the new environment. In this paper a new algorithm for TEP is presented. The method is based on probabilisti...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016